Average Minimum Heliotron Magnetic.Field with Inner Ring Conductors
نویسندگان
چکیده
منابع مشابه
Minimum Average Cost Clustering
A number of objective functions in clustering problems can be described with submodular functions. In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions. The proposed algorithm does not require the number of clusters in advance, and it will be determined by the ...
متن کاملMinimum Average Distance Triangulations
Some of the following problems look similar to the MAD Triangulation problem, but we have not found any deep connections: •Minimum Average Distance Spanning Subgraph in a budgeted version [2] was studied in the context of network design (minimizing average routing time). The problem is NP-complete even with unit weights. •Minimum Average Distance Spanning Tree [1]. NP-completeness is implied by...
متن کاملThe Ratio-type Estimators of Variance with Minimum Average Square Error
The ratio-type estimators have been introduced for estimating the mean and total population, but in recent years based on the ratio methods several estimators for population variance have been proposed. In this paper two families of estimators have been suggested and their approximation mean square error (MSE) have been developed. In addition, the efficiency of these variance estimators are com...
متن کاملFinding k-Connected Subgraphs with Minimum Average Weight
We consider the problems of finding k-connected spanning subgraphs with minimum average weight. We show that the problems are NP-hard for k > 1. Approximation algorithms are given for four versions of the minimum average edge weight problem: 1. 3-approximation for k-edge-connectivity, 2. O(logk) approximation for k-node-connectivity 3. 2+ approximation for k-node-connectivity in Euclidian graph...
متن کاملThe Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, points in the interior of the convex hull). As a case study, we consider the minimum weight triangulation problem. Finding a minimum weight triangulation for a set of n points in the plane is not known to be NP-hard nor so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kakuyūgō kenkyū
سال: 1968
ISSN: 0451-2375,1884-9571
DOI: 10.1585/jspf1958.20.165